Multiplicity-Free Key Polynomials
نویسندگان
چکیده
The key polynomials, defined by Lascoux–Schützenberger, are characters for the Demazure modules of type A. We classify multiplicity-free polynomials. proof uses two combinatorial models first is due to Kohnert. second in terms Searles’ rule quasi-key polynomials Assaf–Searles. Our argument proves a sufficient condition polynomial be multiplicity-free.
منابع مشابه
Invariant Polynomials for Multiplicity Free Actions
This work concerns linear multiplicity free actions of the complex groups GC = GL(n,C), GL(n,C) × GL(n,C) and GL(2n,C) on the vector spaces V = Sym(n,C), Mn(C) and Skew(2n,C). We relate the canonical invariants in C[V ⊕ V ∗] to spherical functions for Riemannian symmetric pairs (G,K) where G = GL(n,R), GL(n,C) or GL(n,H) respectively. These in turn can be expressed using three families of class...
متن کاملMultiplicity of Zeros and Discrete Orthogonal Polynomials
We consider a problem of bounding the maximal possible multiplicity of a zero of some expansions ∑ aiFi(x), at a certain point c, depending on the chosen family {Fi}. The most important example is a polynomial with c = 1. It is shown that this question naturally leads to discrete orthogonal polynomials. Using this connection we derive some new bounds, in particular on the multiplicity of the ze...
متن کاملA Classiication of Multiplicity Free Representations 1. Facts about Multiplicity Free Representations
Let G be a connected reductive linear algebraic group over C and let (; V) be a regular representation of G. There is a locally-nite representation (^ ; C V ]) on the aane algebra C V ] of V deened by ^ (g)f(v) = f(g ?1 v) for f 2 C V ]. Since G is reductive, (^ ; C V ]) decomposes as a direct sum of irreducible regular representations of G. The representation (; V) is said to be multiplicity f...
متن کاملOn the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملConference Key Establishment Using Polynomials
In 1992, Blundo et al. have proposed a non-interactive k-secure m-conference protocol based on an m-variate polynomial over a finite field Fp. The key distribution center (KDC) is responsible to pick a symmetric m-variate polynomial of degree k and generate shares for users. Each share is a symmetric polynomial involving m− 1 variables of degree k, and needs to store the coefficients of such a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2022
ISSN: ['0219-3094', '0218-0006']
DOI: https://doi.org/10.1007/s00026-022-00574-7